Case-Based Reasoning in Scheduling: Reusing Solution Components
نویسنده
چکیده
In this paper we explore the reuse of components of known good schedules in new scheduling problems. This involves accumulating a case-base of good quality schedules, retrieving a case (or cases) similar to a new scheduling problem and building a new schedule from components of the retrieved cases. We start by introducing the components of Case-Based Reasoning (CBR) and we describe a CBR solution to a Travelling Salesman Problem in order to illustrate the use of CBR in optimisation problems. Two CBR solutions to a single machine scheduling problem with sequence dependent setup times are described. These are evaluated by comparing them with two more conventional alternative techniques – simulated annealing and myopic search. Both CBR techniques are shown to provide good quality solutions quickly.
منابع مشابه
CBR in Scheduling: Reusing Solution Components
In this paper we explore the reuse of components of known good schedules in new scheduling problems. This involves accumulating a case-base of good quality schedules, retrieving a case (or cases) similar to a new scheduling problem and building a new schedule from components of the retrieved cases. Two CBR solutions to a single machine scheduling problem with schedule dependent setup times are ...
متن کاملIntegrating CBR and Heuristic Search for Learning and Reusing Solutions in Real-Time Task Scheduling
This paper presents the Case-Based Reasoning Real-Time Scheduling System (CBR-RTS) that integrates into a case-based reasoning framework a heuristic search component. The problem addressed involves scheduling sets of tasks with precedence, ready time and deadline constraints. CBR-RTS reuses the solution of known cases to simplify and solve new problems. When the system does not have applicable ...
متن کاملIndexation by subsumption in Cased based reasoning
Reasoning by re-using past cases is a powerful and frequently applied way to solve problems for humans. A case based reasoner solves new problems by remembering a previous similar situation and by reusing information and knowledge of that situation by adapting solutions that were used to solve old problems. A new problem is solved by retrieving one or more previously experienced cases, reusing ...
متن کاملSpecial Track on Case-Based Reasoning
Case-based reasoning (CBR) is an artificial intelligence problem solving and analysis methodology that retrieves and adapts previous experiences to fit new contexts. In CBR systems, expertise is embodied in a library of past cases, rather than being encoded in classical rules. A new problem is solved by finding a similar past case and reusing it in the new problem situation. erefore, the knowl...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کامل